Results Concerning Thinness of D0l Languages
نویسنده
چکیده
A language L is called thin if there exists an integer n0 such that for all n n0 L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin. TUCS Research Group Mathematical Structures of Computer Science
منابع مشابه
The Equivalence Problem for DF0L Languages and Power Series
The theory of free monoids lies at the crossroads of mathematics and theoretical computer science. Many problems studied in free monoid theory have their origins in theoretical computer science. On the other hand, their solutions often require deep methods from classical mathematics. D0L systems constitute a very natural framework for studying free monoid morphisms and their iterations. Infinit...
متن کاملOn the Frequency of Factors in a D0L Word
We study the frequency of factors in a D0L word on an alphabet , which is known to constitute a probability measure on the set of all sequences on. For the general case, we obtain a recurrence formula describing the frequency of a given word. Then we use this formula to give a precise description of the frequencies of factors in a circular marked uniform D0L word.
متن کاملBispecial factors in circular non-pushy D0L languages
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent. keywords: bispecial factors, circular D0L systems, non-pushy D0L systems, cri...
متن کاملCellular Automata equivalent to D0L Systems
This paper describes an algorithm for the construction of a certain one-dimensional cellular automaton equivalent to a given D0L system. A cellular automaton is considered equivalent to an L-system if both generates the same words in the same order. Our cellular automata produce the same words and in the same order as the given D0L system for a finite number of derivations. There is no constrai...
متن کاملOn Formal Power Series Generated by Lindenmayer Systems
To study power series generated by Lindenmayer systems we de ne L algebraic systems and series over arbitrary commutative semirings. We establish closure and xed point properties of L algebraic series. We show how the framework of L algebraic series can be used to de ne D0L, 0L, E0L, DT0L, T0L and ET0L power series. We generalize for power series the classical result stating that D0L languages ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 10 شماره
صفحات -
تاریخ انتشار 2000